Isogenies of Elliptic Curves: A Computational Approach

نویسنده

  • Daniel Shumow
چکیده

The study of elliptic curves has historically been a subject of almost purely mathematical interest. However, Koblitz and Miller independently showed that elliptic curves can be used to implement cryptographic primitives [13], [17]. This thrust elliptic curves from the abstract realm of pure mathematics to the preeminently applied world of communications security. Public key cryptography in general advanced the development of the Internet and was in turn further advanced by this new use. Elliptic curve cryptography (ECC) was also developed and advanced along with the general field of public key cryptography. Elliptic curves provide benefits over the groups previously proposed for use in cryptography. Unlike finite fields, elliptic curves do not have a ring structure (the two related group operations of addition and multiplication), and hence are not vulnerable to index calculus like attacks [12]. The direct effect of this is that using elliptic curves over smaller finite fields yields the same security as using discrete log or factoring based public key crypto systems of Diffie-Hellman and RSA with larger moduli. This makes ECC ideally suited to small embedded and low power devices such as cell phones. So it is unsurprising that as these type of small devices have increased in popularity in recent years, ECC has as well. As elliptic curves are now used in cryptography, the computational aspects of them have real world applications. The underlying theory is very deep and touches on many different branches of mathematics. Elliptic curves have a very rich mathematical structure and the subject of ECC is about determining how to best apply and efficiently compute with this deep structure. The maps defined on any mathematical object are a key part of the underlying structure. In the case of elliptic curves, the principal maps of interest are the isogenies. An isogeny is a non-constant function, defined on an elliptic curve, that takes values on another elliptic curve and preserves point addition. In short, isogenies are functions that preserve the elliptic curve structure. As

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diffie-Hellman type key exchange protocols based on isogenies

‎In this paper‎, ‎we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves‎. ‎The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $‎, ‎is a straightforward generalization of elliptic curve Diffie-Hellman key exchange‎. ‎The method uses commutativity of the endomorphism ring $ End(E) $‎. ‎Then using dual isogenies‎, ‎we propose...

متن کامل

Isogenies on Edwards and Huff curves

Isogenies of elliptic curves over finite fields have been well-studied, in part because there are several cryptographic applications. Using Vélu’s formula, isogenies can be constructed explicitly given their kernel. Vélu’s formula applies to elliptic curves given by a Weierstrass equation. In this paper we show how to similarly construct isogenies on Edwards curves and Huff curves. Edwards and ...

متن کامل

Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies

We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main technical idea in our scheme is that we transmit the images of torsion bases under the isogeny in order to allow the two parties to arrive at a common shared key despite the noncommutativity of the endomorphism ring. Ou...

متن کامل

Fast Point Multiplication on Elliptic Curves through Isogenies

Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitable as they reduce the computational workload in a point multiplication. In this case, choosing for parameter a the value −3 further reduces the workload. Over Fp, not all elliptic curves can be rescaled through isomorp...

متن کامل

Isogeny cordillera algorithm to obtain cryptographically good elliptic curves

The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computationally unfeasible when elliptic curves are suitably chosen. This paper provides an algorithm to obtain cryptographically good elliptic curves from a given one. The core of such a procedure lies on the usage of successi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2009  شماره 

صفحات  -

تاریخ انتشار 2009